\relax 
\@writefile{toc}{\contentsline {chapter}{\numberline {3}Solution Approach To Capacity Expansion Problem in Survivable Networks}{17}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\newlabel{chap-three}{{3}{17}}
\@writefile{toc}{\contentsline {section}{\numberline {3.1}Feasibility Test}{17}}
\@writefile{toc}{\contentsline {section}{\numberline {3.2}Finding All Possible Paths between Two Nodes}{17}}
\@writefile{toc}{\contentsline {section}{\numberline {3.3}Reduction of Solution Space}{17}}
\@writefile{toc}{\contentsline {paragraph}{Proposition 1}{18}}
\@writefile{toc}{\contentsline {paragraph}{\indent }{18}}
\newlabel{eq:hist0}{{3.1}{18}}
\newlabel{eq:hist1}{{3.2}{18}}
\newlabel{eq:hist2}{{3.3}{18}}
\newlabel{eq:hist3}{{3.4}{18}}
\newlabel{eq:hist4}{{3.5}{18}}
\newlabel{eq:hist-23}{{3.6}{18}}
\newlabel{eq:hist5}{{3.7}{18}}
\newlabel{eq:hist6}{{3.8}{18}}
\newlabel{eq:hist7}{{3.9}{18}}
\newlabel{eq:hist8}{{3.10}{19}}
\newlabel{eq:hist9}{{3.11}{19}}
\newlabel{eq:hist10}{{3.12}{19}}
\newlabel{eq:hist12}{{3.13}{19}}
\newlabel{eq:hist13}{{3.14}{19}}
\newlabel{eq:hist14}{{3.15}{19}}
\newlabel{eq:hist15}{{3.16}{19}}
\newlabel{eq:hist16}{{3.17}{20}}
\newlabel{eq:hist17}{{3.18}{20}}
\newlabel{eq:hist18}{{3.19}{20}}
\newlabel{eq:hist19}{{3.20}{20}}
\@writefile{toc}{\contentsline {paragraph}{Example 1}{20}}
\@writefile{toc}{\contentsline {paragraph}{Proposition 2}{21}}
\newlabel{eq:hist20}{{3.21}{21}}
\newlabel{eq:hist21}{{3.22}{21}}
\newlabel{eq:hist22}{{3.23}{21}}
\newlabel{eq:hist23}{{3.24}{21}}
\newlabel{eq:hist24}{{3.25}{21}}
\newlabel{eq:hist25}{{3.26}{21}}
\newlabel{eq:hist26}{{3.27}{21}}
\newlabel{eq:hist27}{{3.28}{22}}
\@writefile{toc}{\contentsline {paragraph}{Example 2}{22}}
\@writefile{toc}{\contentsline {section}{\numberline {3.4}Bounds on the Objective Function }{24}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.4.1}Upper Bounds on the Cost Function}{24}}
\@writefile{toc}{\contentsline {paragraph}{Lemma 1}{24}}
\newlabel{eq:hist33}{{3.40}{24}}
\@writefile{toc}{\contentsline {paragraph}{Proposition 3}{24}}
\newlabel{eq:hist28}{{3.41}{25}}
\newlabel{eq:hist29}{{3.42}{25}}
\newlabel{eq:hist30}{{3.43}{25}}
\@writefile{toc}{\contentsline {paragraph}{Example 3}{25}}
\@writefile{toc}{\contentsline {paragraph}{Proposition 4}{26}}
\newlabel{eq:hist31}{{3.44}{26}}
\newlabel{eq:hist32}{{3.45}{26}}
\@writefile{toc}{\contentsline {paragraph}{\indent }{26}}
\newlabel{eq:hist34}{{3.46}{26}}
\newlabel{eq:hist35}{{3.47}{26}}
\@writefile{lof}{\contentsline {figure}{\numberline {3.1}{\ignorespaces \tmspace  +\thinmuskip {.1667em}\tmspace  +\thinmuskip {.1667em}The network used in example 4}}{27}}
\newlabel{fig:hist3}{{3.1}{27}}
\@writefile{lot}{\contentsline {table}{\numberline {3.1}{\ignorespaces \tmspace  +\thinmuskip {.1667em}\tmspace  +\thinmuskip {.1667em}Example 4 : Demands}}{27}}
\newlabel{tab:four}{{3.1}{27}}
\@writefile{toc}{\contentsline {paragraph}{Example 4}{27}}
\@writefile{lot}{\contentsline {table}{\numberline {3.2}{\ignorespaces \tmspace  +\thinmuskip {.1667em}\tmspace  +\thinmuskip {.1667em}Example 4 : Capacity Expansion Alternatives}}{28}}
\newlabel{tab:five}{{3.2}{28}}
\@writefile{lot}{\contentsline {table}{\numberline {3.3}{\ignorespaces \tmspace  +\thinmuskip {.1667em}\tmspace  +\thinmuskip {.1667em}Example 4 : Failure Scenarios}}{28}}
\newlabel{tab:six}{{3.3}{28}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.4.2}Lower Bounds on the Cost Function}{29}}
\@writefile{toc}{\contentsline {paragraph}{Proposition 5}{29}}
\newlabel{eq:hist36}{{3.48}{29}}
\newlabel{eq:hist37}{{3.49}{29}}
\@writefile{toc}{\contentsline {paragraph}{\indent }{29}}
\newlabel{eq:hist38}{{3.50}{29}}
\newlabel{eq:hist39}{{3.51}{29}}
\@writefile{toc}{\contentsline {paragraph}{Example 5}{30}}
\@writefile{toc}{\contentsline {paragraph}{Lemma 2}{30}}
\@writefile{toc}{\contentsline {paragraph}{\indent }{30}}
\@writefile{toc}{\contentsline {paragraph}{Example 6}{30}}
\@writefile{toc}{\contentsline {section}{\numberline {3.5}Decomposition Approach}{31}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.5.1}The Master Problem}{31}}
\newlabel{eq:hist40}{{3.52}{31}}
\newlabel{eq:hist41}{{3.53}{31}}
\newlabel{eq:hist42}{{3.54}{31}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.5.2}The Sub-Problems}{32}}
\newlabel{eq:hist43}{{3.56}{32}}
\newlabel{eq:hist44}{{3.57}{32}}
\newlabel{eq:hist45}{{3.58}{32}}
\newlabel{eq:hist46}{{3.59}{33}}
\newlabel{eq:hist47}{{3.60}{33}}
\newlabel{eq:hist48}{{3.61}{33}}
\newlabel{eq:hist49}{{3.62}{33}}
\newlabel{eq:hist50}{{3.63}{33}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.5.3}Constructing Feasibility Cuts}{33}}
\newlabel{eq:hist51}{{3.64}{33}}
\newlabel{eq:hist52}{{3.65}{33}}
\newlabel{eq:hist53}{{3.66}{34}}
\newlabel{eq:hist54}{{3.67}{34}}
\newlabel{eq:hist55}{{3.68}{34}}
\newlabel{eq:hist56}{{3.69}{34}}
\newlabel{eq:hist57}{{3.70}{34}}
\newlabel{eq:hist58}{{3.71}{34}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.5.4}Decomposition Algorithm}{34}}
\@setckpt{Chapter-3/Chapter-3}{
\setcounter{page}{36}
\setcounter{equation}{71}
\setcounter{enumi}{7}
\setcounter{enumii}{3}
\setcounter{enumiii}{3}
\setcounter{enumiv}{0}
\setcounter{footnote}{0}
\setcounter{mpfootnote}{0}
\setcounter{part}{0}
\setcounter{chapter}{3}
\setcounter{section}{5}
\setcounter{subsection}{4}
\setcounter{subsubsection}{0}
\setcounter{paragraph}{0}
\setcounter{subparagraph}{0}
\setcounter{figure}{1}
\setcounter{table}{3}
\setcounter{lofdepth}{1}
\setcounter{lotdepth}{1}
\setcounter{r@tfl@t}{0}
\setcounter{cp@cntr}{0}
\setcounter{chapter@totc}{7}
\setcounter{parentequation}{0}
\setcounter{lips@count}{0}
\setcounter{ncsu@appendixtocdepth}{2}
}
